Integrating Scheduling and Queueing For Dynamic Scheduling Problems
نویسندگان
چکیده
Within the scheduling community, there has recently been an increasing interest in modelling and solving of scheduling problems in dynamic and uncertain environments. Such research does not utilize the developments of queueing theory, an area that has examined problems of similar nature. This paper is initial work towards the goal of integrating queueing theory and scheduling. Specifically, by combining concepts and problem settings from queueing theory and scheduling, we obtain new insights about dynamic scheduling.
منابع مشابه
Integrating Queueing Theory and Scheduling for Dynamic Scheduling Problems
Dynamic scheduling problems consist of both challenging combinatorics, as found in classical scheduling problems, and stochastics due to uncertainty about the arrival times, resource requirements, and processing times of jobs. To address these two challenges, we investigate the integration of queueing theory and scheduling. The former reasons about long-run stochastic system characteristics, wh...
متن کاملHybrid Queueing Theory and Scheduling Models for Dynamic Environments with Sequence-Dependent Setup Times
Classically, scheduling research in artificial intelligence has concentrated on the combinatorial challenges arising in a large, static domain where the set of jobs, resource capacities, and other problem parameters are known with certainty and do not change. In contrast, queueing theory has focused primarily on the stochastic arrival and resource requirements of new jobs, de-emphasizing the co...
متن کاملQueueing-Theoretic Approaches for Dynamic Scheduling: A Survey
Within the combinatorial scheduling community, there has been an increasing interest in modelling and solving scheduling problems in dynamic environments. Such problems have also been considered in the field of queueing theory, but very few papers take advantage of developments in both areas, and literature surveys on dynamic scheduling usually make no mention of queueing approaches. In this pa...
متن کاملLong-Run Stability in Dynamic Scheduling
Stability analysis consists of identifying conditions under which the number of jobs in a system is guaranteed to remain bounded over time. To date, such longrun performance guarantees have not been available for periodic approaches to dynamic scheduling problems. However, stability has been extensively studied in queueing theory. In this paper, we introduce stability to the dynamic scheduling ...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کامل